Alternating-Direction Line-Relaxation Methods on Multicomputers
نویسندگان
چکیده
منابع مشابه
Alternating-Direction Line-Relaxation Methods on Multicomputers
We study the multicomputer performance of a three-dimensional Navier-Stokes solver based on alternating-direction line-relaxation methods. We compare several multicomputer implementations, each of which combines a particular line-relaxation method and a particular distributed block-tridiagonal solver. In our experiments, the problem size was determined by resolution requirements of the applicat...
متن کاملImplicit Alternating Direction Methods
in general plane regions and with respect to linear boundary conditions, is a classical problem of numerical analysis. Many such boundary value problems have been solved successfully on high-speed computing machines, using the (iterative) Young-Frankel "successive overrelaxation" (SOR) method as defined in [l] and [2], and variants thereof ("line" and "block" overrelaxation). For this method, e...
متن کاملFast Alternating Direction Optimization Methods
Alternating direction methods are a common tool for general mathematical programming and optimization. These methods have become particularly important in the field of variational image processing, which frequently requires the minimization of non-differentiable objectives. This paper considers accelerated (i.e., fast) variants of two common alternating direction methods: the Alternating Direct...
متن کاملStructured Sparsity via Alternating Direction Methods
We consider a class of sparse learning problems in high dimensional feature space regularized by a structured sparsity-inducing norm that incorporates prior knowledge of the group structure of the features. Such problems often pose a considerable challenge to optimization algorithms due to the non-smoothness and non-separability of the regularization term. In this paper, we focus on two commonl...
متن کاملAlternating Direction Methods for Sparse Covariance Selection
The mathematical model of the widely-used sparse covariance selection problem (SCSP) is an NP-hard combinatorial problem, whereas it can be well approximately by a convex relaxation problem whose maximum likelihood estimation is penalized by the L1 norm. This convex relaxation problem, however, is still numerically challenging, especially for large-scale cases. Recently, some efficient first-or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 1996
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827593253872